Sparse Signal Detection With Compressive Measurements via Partial Support Set Estimation
نویسندگان
چکیده
منابع مشابه
Sparse Signal Reconstruction via Iterative Support Detection
We present a novel sparse signal reconstruction method “ISD”, aiming to achieve fast reconstruction and a reduced requirement on the number of measurements compared to the classical `1 minimization approach. ISD addresses failed reconstructions of `1 minimization due to insufficient measurements. It estimates a support set I from a current reconstruction and obtains a new reconstruction by solv...
متن کاملDetection and Estimation with Compressive Measurements
The recently introduced theory of compressed sensing enables the reconstruction of sparse or compressible signals from a small set of nonadaptive, linear measurements. If properly chosen, the number of measurements can be much smaller than the number of Nyquist rate samples. Interestingly, it has been shown that random projections are a satisfactory measurement scheme. This has inspired the des...
متن کاملManifold-Based Signal Recovery and Parameter Estimation from Compressive Measurements
A field known as Compressive Sensing (CS) has recently emerged to help address the growing challenges of capturing and processing high-dimensional signals and data sets. CS exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive (or random) linear measurements of that signal. Strong theoretical guarantees have been establi...
متن کاملSupport Detection for SAR Tomographic Reconstructions from Compressive Measurements
The problem of detecting and locating multiple scatterers in multibaseline Synthetic Aperture Radar (SAR) tomography, starting from compressive measurements and applying support detection techniques, is addressed. Different approaches based on the detection of the support set of the unknown sparse vector, that is, of the position of the nonzero elements in the unknown sparse vector, are analyze...
متن کاملSparse Signal Recovery from Quadratic Measurements via Convex Programming
In this paper we consider a system of quadratic equations |〈zj ,x〉|2 = bj , j = 1, ...,m, where x ∈ R is unknown while normal random vectors zj ∈ R and quadratic measurements bj ∈ R are known. The system is assumed to be underdetermined, i.e., m < n. We prove that if there exists a sparse solution x i.e., at most k components of x are non-zero, then by solving a convex optimization program, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2017
ISSN: 2373-776X,2373-7778
DOI: 10.1109/tsipn.2016.2601025